Search results for "Quantum pseudo-telepathy"

showing 4 items of 4 documents

Nonlocal Quantum XOR Games for Large Number of Players

2010

Nonlocal games are used to display differences between classical and quantum world In this paper, we study nonlocal games with a large number of players We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player, a subclass of nonlocal games We illustrate those methods on the example of the N-player game (due to Ardehali [Ard92]) that provides the maximum quantum-over-classical advantage.

CombinatoricsAlgebraComputer Science::Computer Science and Game TheoryQuantum pseudo-telepathySimple (abstract algebra)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALQuantum worldQuantumMathematics
researchProduct

Advantage of Quantum Strategies in Random Symmetric XOR Games

2013

Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players.

Computer Science::Computer Science and Game TheoryTheoretical computer scienceSequential gameQuantum pseudo-telepathySimple (abstract algebra)Symmetric gameComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryRepeated gameTheoryofComputation_GENERALScreening gameQuantumMathematics
researchProduct

On symmetric nonlocal games

2013

Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.

Discrete mathematicsComputer Science::Computer Science and Game TheoryGeneral Computer ScienceQuantum pseudo-telepathyGeneralizationSymmetric gameComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryTheoryofComputation_GENERALSymmetric probability distributionTheoretical Computer ScienceSimple (abstract algebra)Quantum worldMathematical economicsQuantumMathematicsTheoretical Computer Science
researchProduct

Quantum Strategies Are Better Than Classical in Almost Any XOR Game

2012

We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1−o(1) fraction of all 2-player XOR games.

Discrete mathematicsQuantum pseudo-telepathy010102 general mathematics0103 physical sciencesFraction (mathematics)0101 mathematics010306 general physics01 natural sciencesValue (mathematics)QuantumMathematics
researchProduct